Best-Effort Low-Delay Service

Supporting a Low Delay Best-Effort Class in the Presence of Real-Time Traffic

In this paper we propose a packet scheduler to provide a low delay service to best-effort packets without jeopardizing the delay bounds associated with real-time flows. We show that some of the well known service mechanisms for integrating soft real-time tasks into a hard real-time environment, such as the Total Bandwidth Server of Spuri and Buttazzo, turn out to be special cases of our scheme....

Delivering Quality of Service for Gaming Applications in Best Effort Networks

—This paper describes a scheduler which provides non-elevated Quality of Service (QoS) for two different classes of traffic. A Delay-Sensitive (DS) class receives a low delay service at the expense of an increased probability of packet loss. The non-DS traffic receives at least the same level of throughput as it would in an ordinary best effort network. The design of the scheduler is presented ...

A Novel Scheduler For a Low Delay Service Within Best-Effort

Best Effort Differentiated Services: Trade-off Service Differentiation for Elastic Applications

We propose an architecture and several mechanisms for providing “Best Effort Differentiated Services” (BEDS), a set of services similar to Best Effort in that the QoS provided depends on the network conditions, but differentiated in their tradeoff between packet delay and packet loss probability. This proposal starts from the observation that a single Best Effort service does not fit the needs ...

ABE: Providing a Low-Delay Service within best-effort

We propose Alternative Best-E ort (ABE), a novel service for IP networks, which relies on the idea of providing low-delay at the expense of maybe less throughput. The objective is to retain the simplicity of the original Internet single class, best e ort service, while providing low delay to interactive, adaptive applications. With ABE, every best e ort packet is marked as either green or blue....